Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

Что (кто) такое graph rewriting - определение

Найдено результатов: 673

Graph rewriting

TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH

Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation.

https://en.wikipedia.org/wiki/Graph_rewriting

graph rewriting system

TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH

Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting

An extension of a term rewriting system which uses {graph reduction} on terms represented by directed graphs to avoid duplication of work by sharing expressions.

Double pushout graph rewriting

GRAPH REWRITING FRAMEWORK

User:Ɯ/Double pushout graph rewriting; Double-pushout approach

In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973).

https://en.wikipedia.org/wiki/Double_pushout_graph_rewriting

Rewriting

$'''Pic.2:''' Rule lhs term <math>x*(y*z)</math> matching in term <math>\frac{a*((a+1)*(a+2))}{1*(2*3)}</math>$
$'''Pic.1:''' Schematic triangle diagram of application of a rewrite rule <math>l \longrightarrow r</math> at position <math>p</math> in a term, with matching substitution <math>\sigma</math>$

REPLACING SUBTERM IN A FORMULA WITH ANOTHER TERM

Term rewriting; Term rewriting system; Term-rewriting; Rewrite system; Rewrite rule; Phase-structure rule; Rewriting system; Term Rewriting System; Reducible expression; Redex; Rewrite rules; Transformational rule; Rewriting logic; Term rewrite system; Reduction system; Substitution system; Reduction systems; Termination (term rewriting); Termination (rewriting); Trace rewriting system; Tree rewriting; Rewriter

In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines,

https://en.wikipedia.org/wiki/Rewriting

term rewriting system

$'''Pic.2:''' Rule lhs term <math>x*(y*z)</math> matching in term <math>\frac{a*((a+1)*(a+2))}{1*(2*3)}</math>$
$'''Pic.1:''' Schematic triangle diagram of application of a rewrite rule <math>l \longrightarrow r</math> at position <math>p</math> in a term, with matching substitution <math>\sigma</math>$

REPLACING SUBTERM IN A FORMULA WITH ANOTHER TERM

Term rewriting; Term rewriting system; Term-rewriting; Rewrite system; Rewrite rule; Phase-structure rule; Rewriting system; Term Rewriting System; Reducible expression; Redex; Rewrite rules; Transformational rule; Rewriting logic; Term rewrite system; Reduction system; Substitution system; Reduction systems; Termination (term rewriting); Termination (rewriting); Trace rewriting system; Tree rewriting; Rewriter

(TRS) A collection of rewrite rules used to transform terms (expressions, strings in some formal language) into equivalent terms. See reduction. (1994-11-04)

redex

$'''Pic.2:''' Rule lhs term <math>x*(y*z)</math> matching in term <math>\frac{a*((a+1)*(a+2))}{1*(2*3)}</math>$
$'''Pic.1:''' Schematic triangle diagram of application of a rewrite rule <math>l \longrightarrow r</math> at position <math>p</math> in a term, with matching substitution <math>\sigma</math>$

REPLACING SUBTERM IN A FORMULA WITH ANOTHER TERM

Term rewriting; Term rewriting system; Term-rewriting; Rewrite system; Rewrite rule; Phase-structure rule; Rewriting system; Term Rewriting System; Reducible expression; Redex; Rewrite rules; Transformational rule; Rewriting logic; Term rewrite system; Reduction system; Substitution system; Reduction systems; Termination (term rewriting); Termination (rewriting); Trace rewriting system; Tree rewriting; Rewriter

Reducible Expression. An expression matching the left hand side of a reduction rule or definition.

Null graph

GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)

Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph

In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").

https://en.wikipedia.org/wiki/Null_graph

Turán graph

GRAPH

Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph

The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is

https://en.wikipedia.org/wiki/Turán_graph

Dense graph

GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES

Sparse graph; Graph density; Density (graph theory)

In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.

https://en.wikipedia.org/wiki/Dense_graph

Butterfly graph

PLANAR GRAPH WITH 5 NODES AND 6 EDGES

Bowtie graph; Hourglass graph; Bowtie-free graphs; Bowtie-free graph

In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges.ISGCI: Information System on Graph Classes and their Inclusions.

https://en.wikipedia.org/wiki/Butterfly_graph